منابع مشابه
Partitional Clustering Techniques for Multi-Spectral Image Segmentation
Analyzing unknown data sets such as multispectral images often requires unsupervised techniques. Data clustering is a well known and widely used approach in such cases. Multi-spectral image segmentation requires pixel classification according to a similarity criterion. For this particular data, partitional clustering seems to be more appropriate. Classical K-means algorithm has important drawba...
متن کاملThe proportional partitional Shapley value
A new coalitional value is proposed under the hypothesis of isolated unions. The main difference between this value and the Aumann–Drèze value is that the allocations within each union are not given by the Shapley value of the restricted game but proportionally to the Shapley value of the original game. Axiomatic characterizations of the new value, examples illustrating its application and a co...
متن کاملFuzzy Partitional Clustering Algorithms
Fuzzy partitional clustering algorithms are widely used in pattern recognition field. Until now, more and more research results on them have been developed in the literature. In order to study these algorithms systematically and deeply, they are reviewed in this paper based on c-means algorithm, from metrics, entropy, and constraints on membership function or cluster centers. Moreover, the adva...
متن کاملSimplified Expressions of the Multi-Indexed Laguerre and Jacobi Polynomials
The multi-indexed Laguerre and Jacobi polynomials form a complete set of orthogonal polynomials. They satisfy second-order differential equations but not three term recurrence relations, because of the ‘holes’ in their degrees. The multi-indexed Laguerre and Jacobi polynomials have Wronskian expressions originating from multiple Darboux transformations. For the ease of applications, two differe...
متن کاملOn Partitional Clustering of Malware
In this paper we fully describe a novel clustering method for malware, from the transformation of data into a manipulable standardised data matrix, finding the number of clusters until the clustering itself including visualisation of the high-dimensional data. Our clustering method deals well with categorical data and clusters the behavioural data of 17,000 websites, acquired with Capture-HPC, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1979
ISSN: 0012-365X
DOI: 10.1016/0012-365x(79)90120-1